The Fixed-point Partition Lattices

نویسنده

  • PHIL HANLON
چکیده

Let σ be a permutation of the set {1,2, — -, n} and let Π(N) denote the lattice of partitions of {1,2, •••,%}. There is an obvious induced action of σ on Π(N); let Π(N)σ — L denote the lattice of partitions fixed by σ. The structure of L is analyzed with particular attention paid to ^f, the meet sublattice of L consisting of 1 together with all elements of L which are meets of coatoms of L. It is shown that ^ is supersolvable, and that there exists a pregeometry on the set of atoms of ~^ whose lattice of flats G is a meet sublattice of ^ C It is shown that G is supersolvable and results of Stanley are used to show that the Birkhoff polynomials B (λ) and BG{λ) are BG{λ) = W 1)U i) U (m and

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical points of quadratic renormalizations of random variables and phase transitions of disordered polymer models on diamond lattices.

We study the wetting transition and the directed polymer delocalization transition on diamond hierarchical lattices. These two phase transitions with frozen disorder correspond to the critical points of quadratic renormalizations of the partition function. (These exact renormalizations on diamond lattices can also be considered as approximate Migdal-Kadanoff renormalizations for hypercubic latt...

متن کامل

Instanton classical solutions of SU(3) fixed point actions on open lattices

We construct instanton-like classical solutions of the fixed point action of a suitable renormalization group transformation for the SU(3) lattice gauge theory. The problem of the non-existence of one-instantons on a lattice with periodic boundary conditions is circumvented by working on open lattices. We consider instanton solutions for values of the size (0.61.9 in lattice units) which are re...

متن کامل

GENERALIZED RESIDUATED LATTICES BASED F-TRANSFORM

The aim of the present work is to study the  $F$-transform over a generalized residuated lattice.  We discuss the properties that are common with the $F$-transform over a residuated lattice. We show that the $F^{uparrow}$-transform can be used in establishing a fuzzy (pre)order on the set of fuzzy sets.

متن کامل

Properties of Relational Structures , Posets , Lattices and Maps 1

In the paper we present some auxiliary facts concerning posets and maps between them. Our main purpose, however is to give an account on complete lattices and lattices of ideals. A sufficient condition that a lattice might be complete, the fixed-point theorem and two remarks upon images of complete lattices in monotone maps, introduced in [10, pp. 8–9], can be found in Section 7. Section 8 deal...

متن کامل

Properties of Relational Structures , Posets , Lattices and Maps 1 Mariusz Żynel

In the paper we present some auxiliary facts concerning posets and maps between them. Our main purpose, however is to give an account on complete lattices and lattices of ideals. A sufficient condition that a lattice might be complete, the fixed-point theorem and two remarks upon images of complete lattices in monotone maps, introduced in [9, pp. 8–9], can be found in Section 7. Section 8 deals...

متن کامل

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004